Inaccessible back: frustration and misery of lonely patients
نویسندگان
چکیده
منابع مشابه
The Repressor-Lattice: Feed-Back, Commensurability, and Dynamical Frustration
We construct a hexagonal lattice of repressing genes, such that each node represses three of the neighbors, and use it as a model for genetic regulation in spatially extended systems. Using symmetry arguments and stability analysis we argue that the repressor-lattice can be in a nonfrustrated oscillating state with only three distinct phases. If the system size is not commensurate with three, o...
متن کاملThe Compare of Perceived Stress and Feeling Lonely in Breast Cancer Patients and Normal Individuals
Objective: The purpose of this study was to examine the compare of perceived stress and feeling lonely in breast cancer patients and normal individuals. Methods: This research is causal-comparative. The population consist of all patients with breast cancer in hospitals of Ardebil. 60 patients and 60 normal individuals were selected with sampling method. The s...
متن کاملThe Compare of Perceived Stress and Feeling Lonely in Breast Cancer Patients and Normal Individuals
Objective: The purpose of this study was to examine the compare of perceived stress and feeling lonely in breast cancer patients and normal individuals. Methods: This research is causal-comparative. The population consist of all patients with breast cancer in hospitals of Ardebil. 60 patients and 60 normal individuals were selected with sampling method. The s...
متن کاملInvestigating the Relationship between Misery Index and Patients' Out-of-pocket Payments in Iran's Health System
Background: One of the criteria for measuring the performance of governments and their survival is the degree of success in reducing and stabilizing the misery index. The misery index is obtained from the sum of inflation and unemployment. Inflation and unemployment are the most important factors affecting family's income. If the misery index is high, families will have less money to buy their ...
متن کاملColoring and the Lonely Graph
We improve upper bounds on the chromatic number proven independently in [1] and [5]. Our main lemma gives a sufficient condition for two paths in graph to be completely joined. Using this, we prove that if a graph has an optimal coloring with more than ω2 singleton color classes, then it satisfies χ ≤ ω+∆+1 2 . It follows that a graph satisfying n − ∆ < α + ω−1 2 must also satisfy χ ≤ ω+∆+1 2 ,...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Clinical Medicine
سال: 2019
ISSN: 1470-2118,1473-4893
DOI: 10.7861/clinmedicine.19-2-s124